# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def integerBreak(self, n: int) -> int:
        dp = [0] * (n + 1)     # dp[i]为整数i拆分后的最大乘积
        dp[2] = 1   # 2的最大乘积为1

        for i in range(3, n + 1):
            temp_max = 0
            for j in range(1, i):
                temp_max = max(j * (i-j), j * dp[i-j], temp_max)
            dp[i] = temp_max

        return dp[n]


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        (2, 1),
        (10, 36)
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        expect = case_item[len(case_item) - 1]

        exec_result = solution.integerBreak(input1)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

